235 research outputs found
The Minimal Total Irregularity of Graphs
In \cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph
as
\hskip3.3cm
\noindent where denotes the vertex degree of a vertex . In
this paper, we investigate the minimal total irregularity of the connected
graphs, determine the minimal, the second minimal, the third minimal total
irregularity of trees, unicyclic graphs, bicyclic graphs on vertices, and
propose an open problem for further research.Comment: 13 pages, 4 figure
- β¦